2000]15a45, 14l24 Inequalities for Numerical Invariants of Sets of Matrices
نویسنده
چکیده
The spectral radius of every d× d matrix A is bounded from below by c ‖A‖ ‖A‖, where c = c(d) > 0 is a constant and ‖·‖ is any operator norm. We prove an inequality that generalizes this elementary fact and involves an arbitrary number of matrices. In the proof we use geometric invariant theory. The generalized spectral radius theorem of Berger and Wang is an immediate consequence of our inequality. 1. Motivation and statement of the result Let M(d) be the space of d×d complex matrices. If A ∈ M(d), we indicate by ρ(A) the spectral radius of A, that is, the maximum absolute value of an eigenvalue of A. Given a norm ‖·‖ in Cd, we endow the space M(d) with the operator norm ‖A‖ = sup {‖Av‖; ‖v‖ = 1}. For every A ∈ M(d) and every norm ‖·‖ in Cd, we have ρ(A) ≤ ‖A‖. On the other hand, there is also a lower bound for ρ(A) in terms of norms: ‖A‖ ≤ Cρ(A)‖A‖, where C = 2 − 1. (1) In particular, if ρ(A) ≪ ‖A‖ then ‖Ad‖ ≪ ‖A‖d. Inequality (1) is a very simple consequence of the Cayley-Hamilton theorem. Indeed, let p(z) = zd − σ1z d−1 + · · · + (−1)σd be the characteristic polynomial of A. Since p(A) = 0,
منابع مشابه
Inequalities for Numerical Invariants of Sets of Matrices
We prove three inequalities relating some invariants of sets of matrices, such as the joint spectral radius. One of the inequalities, in which proof we use geometric invariant theory, has the generalized spectral radius theorem of Berger and Wang as an immediate corollary.
متن کاملFurther inequalities for operator space numerical radius on 2*2 operator matrices
We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$, when $X$ is a numerical radius operator space. These inequalities contain some upper and lower bounds for operator space numerical radius.
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملCartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملSome numerical radius inequalities with positive definite functions
Using several examples of positive definite functions, some inequalities for the numerical radius of matrices are investigated. Also, some open problems are stated.
متن کامل